t=int(input())
result=[]
for _ in range(t):
n=int(input())
a=list(map(int,input().split()))
if(n==1):
result.append("1")
continue
my_set=set()
sums=sum(a)
max_sim=0
my_set.add(a[0])
b=[0]*n
count=1
for i in a[1:]:
if(i in my_set):
max_sim=max(max_sim,i)
else:
my_set.add(i)
b[count]=max_sim
count+=1
if(set(b)=={0}):
result.append(str(sums))
continue
sums+=sum(b)
my_set=set([b[0]])
max_sim=0
bro=[0]*n
count=1
for i in b[1:]:
if(i in my_set):
if(i>max_sim):
max_sim=i
else:
my_set.add(i)
bro[count]=max_sim
count+=1
if(set(bro)=={0}):
result.append(str(sums))
continue
for i in range(n):
if(bro[n-1-i]==0):
break
sums+=bro[n-1-i]*(i+1)
result.append(str(sums))
print("\n".join(result))
232. Implement Queue using Stacks | 844. Backspace String Compare |
20. Valid Parentheses | 746. Min Cost Climbing Stairs |
392. Is Subsequence | 70. Climbing Stairs |
53. Maximum Subarray | 1527A. And Then There Were K |
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers | 318. Maximum Product of Word Lengths |
448. Find All Numbers Disappeared in an Array | 1155. Number of Dice Rolls With Target Sum |
415. Add Strings | 22. Generate Parentheses |
13. Roman to Integer | 2. Add Two Numbers |
515. Find Largest Value in Each Tree Row | 345. Reverse Vowels of a String |
628. Maximum Product of Three Numbers | 1526A - Mean Inequality |
1526B - I Hate 1111 | 1881. Maximum Value after Insertion |
237. Delete Node in a Linked List | 27. Remove Element |
39. Combination Sum | 378. Kth Smallest Element in a Sorted Matrix |
162. Find Peak Element | 1529A - Eshag Loves Big Arrays |
19. Remove Nth Node From End of List | 925. Long Pressed Name |